Lectures on Contingency Tables Electronic edition

نویسنده

  • Steffen L. Lauritzen
چکیده

Preface The present set of lecture notes are prepared for the course " Statistik 2 " at the University of Copenhagen. It is a revised version of notes prepared in connection with a series of lectures at the Swedish summerschool in Särö, June 11–17, 1979. The notes do by no means give a complete account of the theory of contingency tables. They are based on the idea that the graph theoretic methods in Darroch, Lauritzen and Speed (1978) can be used directly to develop this theory and, hopefully, with some pedagogical advantages. My thanks are due to the audience at the Swedish summerschool for patiently listening to the first version of these lectures, to Joseph Verducci, Stanford, who read the manuscript and suggested many improvements and corrections, and to Ursula Hansen, who typed the manuscript. The second edition is different from the first basically by the fact that a number of errors have been removed, certain simplifications have been achieved and some recent results about collapsibility have been included. In the third edition more errors have been corrected and other minor changes have been made. There has been some effort to bring the list of references up to date. Finally a section on other sampling schemes (Poisson models and sampling with one fixed marginal) has been added. This section is based upon notes by Inge Henningsen and I am grateful for her permission to include this material. Again Søren Asmussen and Søren Tolver Jensen have found errors and made many detailed suggestions for improvements in the presentation. Helle Andersen and Helle Westmark have helped transforming the typescript into a typeset document. Søren L. Buhl has given me very helpful comments on this manuscript. Thank you. The only essential changes from the third edition to this one is that some figures and tables have been redrawn and some changes have been made to the typesetting, to accomodate the electronic medium. Some references have also been updated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Plain Answers to Several Questions about Association/Independence Structure in Complete/Incomplete Contingency Tables

In this paper, we develop some results based on Relational model (Klimova, et al. 2012) which permits a decomposition of logarithm of expected cell frequencies under a log-linear type model. These results imply plain answers to several questions in the context of analyzing of contingency tables. Moreover, determination of design matrix and hypothesis-induced matrix of the model will be discusse...

متن کامل

Analysis of Dynamic Longitudinal Categorical Data in Incomplete Contingency Tables Using Capture-Recapture Sampling: A case Study of Semi-Concentrated Doctoral Exam

Abstract. In this paper, dynamic longitudinal categorical data and estimation of their parameters in incomplete contingency tables are evaluated. To apply the proposed method, a study has been conducted on the data of the semi-concentrated doctoral exam of the National Organization for Educational Testing (NOET). The results of studies such as the obtained confidence intervals and calculating t...

متن کامل

Preface to the 3rd Edition

The chapter on regression models focuses on a core business of multivariate statistical analysis. This contribution has not been subject of a prominent discussion in earlier editions of this book. We now take the opportunity to cover classical themes of ANOVA and ANCOVA analysis. Categorial responses are presented Section 8.2. The spectrum of log linear models for contingency tables is presente...

متن کامل

Sampling and Counting Contingency Tables Using Markov Chains

In this paper we present an overview of contingency tables, provide an introduction to the problems of almost uniform sampling and approximate counting, and show recent results achieved through the use of Markov chains. We focus specifically on contingency tables with two rows, since as of this time little progress has been made in achieving reasonable bounds on arbitrarily sized contingency ta...

متن کامل

Approximate Counting Scheme for m X n Contingency Tables

In this paper, we propose a new counting scheme for m × n contingency tables. Our scheme is a modification of Dyer and Greenhill’s scheme for two rowed contingency tables [5]. We can estimate not only the sizes of error, but also the sizes of the bias of the number of tables obtained by our scheme, on the assumption that we have an approximate sampler. key words: counting, approximation, #P-com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002